Precise Interprocedural Side-Effect Analysis
نویسندگان
چکیده
A side-effect analysis computes for each program phrase a set of memory locations that may be read or written to when executing this phrase. Our analysis expresses abstract objects, points-to and aliasing information, escape information, and side effects all in terms of a single novel abstract domain, generalized access graphs. This abstract domain represents sets of access paths precisely and compactly. It is suitable for intraprocedural analysis as well as for constructing method summaries for interprocedural analysis. We implement the side-effect analysis for Java on top of the SOOT framework and report on its application to selected examples.
منابع مشابه
Interprocedural Control Flow Analysis
Control Flow Analysis is a widely used approach for analysing functional and object oriented programs. Once the applications become more demanding also the analysis needs to be more precise in its ability to deal with mutable state (or side-effects) and to perform polyvariant (or context-sensitive) analysis. Several insights in Data Flow Analysis and Abstract Interpretation show how to do so fo...
متن کاملPrecise Interprocedural Analysis in the Presence of Pointers to the Stack
In a language with procedures and pointers as parameters, an instruction can modify memory locations anywhere in the call-stack. The presence of such side effects breaks most generic interprocedural analysis methods, which assume that only the top of the stack may be modified. We present a method that addresses this issue, based on the definition of an equivalent local semantics in which writin...
متن کاملPrecise Interprocedural Dataflow Analysis via Graph Reachability ( Extended
This paper shows how to find precise solutions to a large class of interprocedural dataflow-analysis problems in polynomial time. In contrast with intraprocedural dataflow analysis, where “precise” means “meet-over-all-paths”[16], a precise interprocedural dataflow-analysis algorithm must provide the “meet-over-all-valid-paths” solution. (A path is valid if it respects the fact that when a proc...
متن کاملPMACS: An Environment for Parallel Programming
In this paper, we present a parallel programming environment called PMACS. The central structure of this environment is the Parametrized Dependence Graph that gives a very precise representation of dependencies. It also facilitates the recompilation of dependencies whenever the user is requested to introduce information about the program. A unique framework for the interprocedural constant prop...
متن کاملEecient Flow-sensitive Interprocedural Computation of Pointer-induced Aliases and Side Eeects
We present practical approximation methods for computing interprocedural aliases and side eeects for a program written in a language that includes pointers, reference parameters and recursion. We present the following results: 1) An algorithm for ow-sensitive interprocedural alias analysis which is more precise and eecient than the best inter-procedural method known. 2) An extension of traditio...
متن کامل